#include<iostream>
#include<cstring>

using namespace std;
const int N = 15;
int n;
int t[N] , d[N] , l[N];
bool st[N]; //标记是否已经停了

bool dfs(int pos , int end)
{
    if(pos > n) return true;
    for(int i = 1;i <= n;i ++)
    {
        if(st[i]) continue;
        if(end > t[i] + d[i]) continue;

        st[i] = true;
        int newend = max(end , t[i]) + l[i];
        if(dfs(pos + 1 , newend)) return true;

        st[i] = false;
    }
    return false;
}
int main()
{
    int T; cin >> T;
    while(T--)
    {   memset(st , 0 , sizeof st);
        cin >> n;
        for(int i = 1;i <= n;i ++) cin >> t[i] >> d[i] >> l[i];
        if (dfs(1 , 0)) cout << "YES" << endl;
        else cout << "NO" << endl;
         //从哪个位置开始  end的位置
    }
    return 0;
}